Robust Shape from Focus via Markov Random Fields

نویسندگان

  • Victor Gaganov
  • Alexey Ignatenko
چکیده

In this paper we study a problem of 3D scene reconstruction from a set of differently focused images, also known as the shape from focus (SFF) problem. Existing shape from focus methods are known to produce unstable depth estimates in areas with poor texture and in presence of strong highlights. So in this work we focus on the robustness of 3D scene structure recovery. We formulate a shape from focus problem in a Bayesian framework using Markov Random Fields and present an SFF method that yields a globally optimal surface with enforced smoothness priors. Although shape from focus has been studied for quite a long time there is no widely accepted test set for evaluation of SFF algorithms. Therefore we present a test set composed of 27 image sets with hand-labeled ground truth. We quantitatively evaluate our method on this test set and present the comparison results. These results demonstrate that our method is robust to highlights and untextured regions and that it outperforms the state-of-the-art.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Inference of Continuous Markov Random Fields with Polynomial Potentials

In this paper, we prove that every multivariate polynomial with even degree can be decomposed into a sum of convex and concave polynomials. Motivated by this property, we exploit the concave-convex procedure to perform inference on continuous Markov random fields with polynomial potentials. In particular, we show that the concave-convex decomposition of polynomials can be expressed as a sum-of-...

متن کامل

Markov fields for recognition derived from facial texture error

When attempting to code faces for modelling or recognition, estimates of dimensions are typically obtained from an ensemble. These tend to be significantly sub-optimal. Each face contains both predictable and non-predictable qualities; only the predictable aspects are useful for defining coding systems for other faces. Additional information, not coded via the ensemble, is still available. We s...

متن کامل

Collaborative filtering via sparse Markov random fields

Recommender systems play a central role in providing individualized access to information and services. This paper focuses on collaborative filtering, an approach that exploits the shared structure among mind-liked users and similar items. In particular, we focus on a formal probabilistic framework known as Markov random fields (MRF). We address the open problem of structure learning and introd...

متن کامل

A spin glass model of a Markov random field

This paper presents a novel algorithm for robust object recognition. We propose to model the visual appearance of objects via probability density functions. The algorithm consists of a fully connected Markov random field with energy function derived from results of statistical physics of spin glasses. Markov random fields and spin glass energy functions are combined together via nonlinear kerne...

متن کامل

How to Combine Color and Shape Information for 3D Object Recognition: Kernels do the Trick

This paper presents a kernel method that allows to combine color and shape information for appearance-based object recognition. It doesn't require to define a new common representation, but use the power of kernels to combine different representations together in an effective manner. These results are achieved using results of statistical mechanics of spin glasses combined with Markov random fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009